Process algebra with prepositional signals
نویسندگان
چکیده
منابع مشابه
Process Algebra with Propositional Signals
We consider processes that have transitions labeled with atomic actions, and states labeled with formulas over a propositional logic. These state labels are called signals. A process in a parallel composition may proceed conditionally, dependent on the presence of a signal in the process in parallel. This allows a natural treatment of signal observation.
متن کاملContradiction-Tolerant Process Algebra with Propositional Signals
In a previous paper, an ACP-style process algebra was proposed in which propositions are used as the visible part of the state of processes and as state conditions under which processes may proceed. This process algebra, called ACPps, is built on classical propositional logic. In this paper, we present a version of ACPps built on a paracon-sistent propositional logic which is essentially the sa...
متن کاملAnalysing Mutual Exclusion using Process Algebra with Signals
In contrast to common belief, the Calculus of Communicating Systems (CCS) and similar process algebras lack the expressive power to accurately capture mutual exclusion protocols without enriching the language with fairness assumptions. Adding a fairness assumption to implement a mutual exclusion protocol seems counter-intuitive. We employ a signalling operator, which can be combined with CCS, o...
متن کاملProcess Algebra with Backtracking
An extension of process algebra for modelling processes with backtracking is introduced. This extension is semantically based on processes that transform data because, in our view, backtracking is the undoing of the eeects caused by a process in some initial data-state if this process fails. The data-states are given by a data environment, which is a structure that also deenes in which data-sta...
متن کاملProcess Algebra with Iteration
We introduce iteration in process algebra by means of (the binary version of) Kleene's star operator: x y is the process that chooses between x and y, and upon termination of x has this choice again. It is proved that adding respectively interleaving, communication and abstraction operators increases expressivity up to the regular processes. However, if the distinction between (successful) term...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00253-8